Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Decoding of Low-Density Parity Check Codes (A Survey)

Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely effici...

متن کامل

Iterative reliability-based decoding of low-density parity check codes

In this paper, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between belief propagatio...

متن کامل

Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes

Hybrid decoding is to combine different iterative decoding algorithms with the aim of improving error performance or decoding complexity. This, e.g., can be performed by using a specific blend of different algorithms in every iteration (time-invariant hybrid: HTI), or by switching between different algorithms throughout the iteration process (switch-type hybrid: HST). In this work, we study HTI...

متن کامل

Iterative Soft Input Soft Output Decoding of Reed-Solomon Codes by Adapting the Parity Check Matrix

An iterative soft input soft output (SISO) decoding algorithm for Reed-Solomon (RS) codes using their binary image representations is presented. The novelty of the iterative algorithm is in reducing a submatrix corresponding to the less reliable bits in the binary parity check matrix of the RS code to a sparse nature before each decoding iteration. The proposed algorithm can geometrically be in...

متن کامل

Iterative Decoding of Low-Density Parity Check Codes∗ (An Introductory Survey)

Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely effici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2005

ISSN: 0018-9448

DOI: 10.1109/tit.2005.853321